On certain pairs of transcendental functions whose roots separate each other
نویسندگان
چکیده
منابع مشابه
Notes on Certain Other (0,2) Correlation Functions
In this paper we shall describe some correlation function computations in perturbative heterotic strings that generalize B model computations. On the (2, 2) locus, correlation functions in the B model receive no quantum corrections, but off the (2, 2) locus, that can change. Classically, the (0, 2) analogue of the B model is equivalent to the previously-discussed (0, 2) analogue of the A model,...
متن کاملOn Certain Pairs of Functions of Semiprime Rings
Let / and g be functions of a set 5 into a semiprime ring R. A necessary and sufficient condition for / and g to satisfy f{s)xg{t) = g{s)xf{t) for all s, t e S, x e R is given. As an application, biderivations and commuting additive mappings of semiprime rings are characterized.
متن کاملA few remarks on “On certain Vandermonde determinants whose variables separate"
In the recent paper “On certain Vandermonde determinants whose variables separate” [Linear Algebra and its Applications 449 (2014) pp. 17–27], there was established a factorized formula for some bivariate Vandermonde determinants (associated to almost square grids) whose basis functions are formed by Hadamard products of some univariate polynomials. That formula was crucial for proving a conjec...
متن کاملPairs of Disjoint q-element Subsets Far from Each Other
Let n and q be given integers and X a finite set with n elements. The following theorem is proved for n > n0(q). The family of all q-element subsets of X can be partitioned into disjoint pairs (except possibly one if (n q ) is odd), so that |A1∩A2|+ |B1 ∩B2| ≤ q, |A1 ∩B2|+ |B1 ∩A2| ≤ q holds for any two such pairs {A1, B1} and {A2, B2}. This is a sharpening of a theorem in [2]. It is also shown...
متن کاملstudy of hash functions based on chaotic maps
توابع درهم نقش بسیار مهم در سیستم های رمزنگاری و پروتکل های امنیتی دارند. در سیستم های رمزنگاری برای دستیابی به احراز درستی و اصالت داده دو روش مورد استفاده قرار می گیرند که عبارتند از توابع رمزنگاری کلیددار و توابع درهم ساز. توابع درهم ساز، توابعی هستند که هر متن با طول دلخواه را به دنباله ای با طول ثابت تبدیل می کنند. از جمله پرکاربردترین و معروف ترین توابع درهم می توان توابع درهم ساز md4, md...
ذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 1901
ISSN: 0002-9947
DOI: 10.1090/s0002-9947-1901-1500578-2